Mass problems and almost everywhere domination
نویسنده
چکیده
We examine the concept of almost everywhere domination from the viewpoint of mass problems. Let AED and MLR be the set of reals which are almost everywhere dominating and Martin-Löf random, respectively. Let b1, b2, b3 be the degrees of unsolvability of the mass problems associated with the sets AED, MLR×AED, MLR∩AED respectively. Let Pw be the lattice of degrees of unsolvability of mass problems associated with nonempty Π1 subsets of 2 ω . Let 1 and 0 be the top and bottom elements of Pw. We show that inf(b1,1) and inf(b2,1) and inf(b3,1) belong to Pw and that 0 < inf(b1, 1) < inf(b2,1) < inf(b3,1) < 1. Under the natural embedding of the recursively enumerable Turing degrees into Pw, we show that inf(b1,1) and inf(b3,1) but not inf(b2,1) are comparable with some recursively enumerable Turing degrees other than 0 and 0′. In order to make this paper more self-contained, we exposit the proofs of some recent theorems due to Hirschfeldt, Miller, Nies, and Stephan.
منابع مشابه
On a conjecture of Dobrinen and Simpson concerning almost everywhere domination
Dobrinen and Simpson [4] introduced the notions of almost everywhere domination and uniform almost everywhere domination to study recursion theoretic analogues of results in set theory concerning domination in generic extensions of transitive models of ZFC and to study regularity properties of the Lebesgue measure on 2 in reverse mathematics. In this article, we examine one of their conjectures...
متن کاملAlmost everywhere domination and superhighness
Let ω denote the set of natural numbers. For functions f, g : ω → ω, we say that f is dominated by g if f(n) < g(n) for all but finitely many n ∈ ω. We consider the standard “fair coin” probability measure on the space 2 of infinite sequences of 0’s and 1’s. A Turing oracle B is said to be almost everywhere dominating if, for measure one many X ∈ 2, each function which is Turing computable from...
متن کاملRecent Aspects of Mass Problems: Symbolic Dynamics and Intuitionism
Mass Problems: A set P ⊆ {0,1} may be viewed as a mass problem, i.e., a decision problem with more than one solution. By definition, the solutions of P are the elements of P . A mass problem is said to be solvable if at least one of its solutions is recursive. A mass problem P is said to be Muchnik reducible to a mass problem Q if for each solution of Q there exists a solution of P which is Tur...
متن کاملAlmost everywhere domination
A Turing degree a is said to be almost everywhere dominating if, for almost all X ∈ 2 with respect to the “fair coin” probability measure on 2, and for all g : ω → ω Turing reducible to X, there exists f : ω → ω of Turing degree a which dominates g. We study the problem of characterizing the almost everywhere dominating Turing degrees and other, similarly defined classes of Turing degrees. We r...
متن کاملTracing and domination in the Turing degrees
We show that if 0′ is c.e. traceable by a, then a is array non-computable. It follows that there is no minimal almost everywhere dominating degree, in the sense of Dobrinen and Simpson [DS04]. This answers a question of Simpson and a question of Nies [Nie09, Problem 8.6.4]. Moreover, it adds a new arrow in [Nie09, Figure 8.1], which is a diagram depicting the relations of various ‘computational...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Log. Q.
دوره 53 شماره
صفحات -
تاریخ انتشار 2007